four-color theorem

См. также в других словарях:

• Four color theorem — Example of a four colored map A four colori …   Wikipedia

• Four Color — This article is about the comic book series. For the topological graph theory, see four color theorem. For the four color model, see CMYK color model. Four Color One of the earlier issues of Four Color (#9 from October 1942), featuring Wal …   Wikipedia

• four-color problem — /fawr kul euhr, fohr /, Math. the problem, solved in 1976, of proving the theorem that any geographic map can be colored using only four colors so that no connected countries with a common boundary are colored the same color. Also called four… …   Universalium

• four-color problem — /fawr kul euhr, fohr /, Math. the problem, solved in 1976, of proving the theorem that any geographic map can be colored using only four colors so that no connected countries with a common boundary are colored the same color. Also called four… …   Useful english dictionary

• Five color theorem — The five color theorem is a result from graph theory that given a plane separated into regions, such as a political map of the counties of a state, the regions may be colored using no more than five colors in such a way that no two adjacent… …   Wikipedia

• Theorem — The Pythagorean theorem has at least 370 known proofs[1] In mathematics, a theorem is a statement that has been proven on the basis of previously established statements, such as other theorems, and previously accepted statements …   Wikipedia

• De Bruijn–Erdős theorem (graph theory) — This article is about coloring infinite graphs. For the number of lines determined by a finite set of points, see De Bruijn–Erdős theorem (incidence geometry). In graph theory, the De Bruijn–Erdős theorem, proved by Nicolaas Govert de Bruijn and… …   Wikipedia

• Automated theorem proving — (ATP) or automated deduction, currently the most well developed subfield of automated reasoning (AR), is the proving of mathematical theorems by a computer program. Decidability of the problem Depending on the underlying logic, the problem of… …   Wikipedia

• Van der Waerden's theorem — is a theorem of the branch of mathematics called Ramsey theory. The theorem is about the basic structure of the integers. It is named for Dutch mathematician B. L. van der Waerden. [B.L. van der Waerden, Beweis einer Baudetschen Vermutung , Nieuw …   Wikipedia

• Nyquist–Shannon sampling theorem — Fig.1: Hypothetical spectrum of a bandlimited signal as a function of frequency The Nyquist–Shannon sampling theorem, after Harry Nyquist and Claude Shannon, is a fundamental result in the field of information theory, in particular… …   Wikipedia

• Hales–Jewett theorem — In mathematics, the Hales–Jewett theorem is a fundamental combinatorial result of Ramsey theory, concerning the degree to which high dimensional objects must necessarily exhibit some combinatorial structure; it is impossible for such objects to… …   Wikipedia